All Questions
2 questions
3votes
3answers
386views
Find k-distinct partitions which contain at least two perfect squares
Problem Statement: A k-distinct-partition of a number \$n\$ is a set of \$k\$ distinct positive integers that add up to \$n\$. For example, the 3-distinct partitions of 10 are \$1+2+7\$ \$1+...
- 387
8votes
2answers
2kviews
Counting Increasing Subsequences of size K recursive
The original description of the problem can be found here, its input here and its expected output here. The problem: Given a integer sequence a1 ... an (-10000 \$\leq\$ ai \$\leq\$ 10000). Where ...
user70000
